Integrating intelligent job-scheduling into a real-world production-scheduling system

نویسندگان

  • Karl Kurbel
  • Andreas Ruppel
چکیده

The paper addresses the problem of scheduling production orders (jobs). First an approach based on simulated annealing and Hopfield nets is described. Since performance was unsatisfactory for real-world applications, we changed problem representation and tuned the scheduling method, dropping features of the Hopfield net and retaining simulated annealing. Both computing time and solution quality were significantly improved. The scheduling method was then integrated into a software system for short-term production planning and control ("electronic leitstand"). The paper describes how real-world requirements are met and how the scheduling method interacts with the leitstand's database and graphical representation of schedules.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical Modeling for a Flexible Manufacturing Scheduling Problem in an Intelligent Transportation System

This paper presents a new mathematical model for a production system through a scheduling problem considering a material handling system as an intelligent transportation system by automated guided vehicles (AGVs). The traditional systems cannot respond to the changes and customer’s demands and for this reason, a flexible production system is used. Therefore, for this purpose, automated transpor...

متن کامل

A New Framework for Dynamic Deterministic Job-Shop Scheduling problems Using Genetic Algorithms

The problem of finding good solutions to scheduling problems is very important to real manufacturing systems, since the production rate and production costs are very dependent on the schedules used for controlling the work in the system. Most research in scheduling focuses on optimisation of static problems, where all problem data are known before scheduling starts. However many real world opti...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)

Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Intelligent Manufacturing

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1996